Recognition of Deterministic ETOL Languages in Logarathimic Space
نویسندگان
چکیده
Recently considerable interest has been shown in questions concerning the complexity of the membership problem for various types of L systems3 In van Leeuwen (1975a) it is shown that there is an E T O L system G such that the set L(G) is ~/ '~-complete . Opatrn3~ and Culik (1975) showed that EOL membership could be determined by a D T I M E (n 4) algorithm, and Sudborough (1976) gave a DSPACE((logn) 2) algorithm (based on a construction in van Leeuwen (1975b)). Sudborough also gave a DSPACE(log n) algorithm for membership in any deterministic EOL language. In this paper we show that membership in L(G) for a deterministic E T O L system G may be determined in NSPACE(log n) and hence that L(G) is also recognizable by a deterministic polynomial time algorithm. 2 This indicates that
منابع مشابه
Remarks on Propagating Partition-Limited ETOL Systems
In this paper, we sharpen the results of G artner on the universality of partition-limited ET0L systems by showing that such deterministic systems characterize the recursively enumerable sets, and, furthermore, the propagating deterministic partition-limited ET0L systems characterize the programmed languages with appearance checking disallowing erasing productions. The main results of this pap...
متن کاملDeterministic Fuzzy Automaton on Subclasses of Fuzzy Regular ω-Languages
In formal language theory, we are mainly interested in the natural language computational aspects of ω-languages. Therefore in this respect it is convenient to consider fuzzy ω-languages. In this paper, we introduce two subclasses of fuzzy regular ω-languages called fuzzy n-local ω-languages and Buchi fuzzy n-local ω-languages, and give some closure properties for those subclasses. We define a ...
متن کاملTOPOLOGICAL CHARACTERIZATION FOR FUZZY REGULAR LANGUAGES
We present a topological characterization for fuzzy regular languages: we show that there is a bijective correspondence between fuzzy regular languages and the set of all clopen fuzzy subsets with finite image in the induced fuzzy topological space of Stone space (Profinite space), and then we give a representation of closed fuzzy subsets in the induced fuzzy topological space via fuzzy regular...
متن کاملSublinearly Space Bounded Iterative Arrays
Iterative arntys (lAs) are a, parallel computational model with a, sequential processing of the input. They are one-dimensional arrays of interacting identical deterministic finite automata. In this note, realtime-lAs with sublinear space bounds are used to accept formal languages. The existence of a proper hierarchy of space complexity classes between logarithmic anel linear space bounds is pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Information and Control
دوره 35 شماره
صفحات -
تاریخ انتشار 1977